Proactive Byzantine Quorum Systems
نویسندگان
چکیده
Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults. This paper presents a Byzantine Quorum Systems protocol that provides atomic semantics despite the existence of Byzantine clients and servers. Moreover, this protocol is integrated with a protocol for proactive recovery of servers. In that way, the system tolerates any number of failures during its lifetime, since no more than f out of n servers fail during a small interval of time between recoveries. All solutions proposed in this paper can be used on asynchronous systems, which requires no time assumptions. The proposed quorum system read and write protocols have been implemented and their efficiency is demonstrated through some experiments carried out in the Emulab platform.
منابع مشابه
Using Byzantine Quorum Systems to Manage Confidential Data∗
This paper addresses the problem of using proactive cryptosystems for generic data storage and retrieval. Proactive cryptosystems provide high security and confidentiality guarantees for stored data, and are capable of withstanding attacks that may compromise all the servers in the system over time. However, proactive cryptosystems are unsuitable for generic data storage uses for two reasons. F...
متن کاملLiterature Survey Report On Quorum Systems
This report summarizes the state of the art in the research area of quorum systems as represented by the papers [PM01], [ES00], [MRW97], and [AMR+00]. Quorum systems are used in fault tolerant distributed computing systems for ensuring the availability of a replicated service and replicated data, even if the replicated servers fail by crashing benignly or in a byzantine, i.e. arbitrary way. Quo...
متن کاملOptimal Byzantine Quorum
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers, and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose intersections contain at least 2b + 1 servers, have been proposed to construct replicated services tolerant of b arbitrary (Byzantine) server failures. In...
متن کاملProbabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocols require n ≥ 5b + 1 servers (where b is the maximum number of faults tolerated), owing to their use of opaque Byzantine quorum systems; this is 2b more servers than required by some non-optimistic protocols. In this ...
متن کاملThe Load and Availability of Byzantine Quorum
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose intersections contain at least 2b+1 servers, have been proposed to construct replicated services tolerant of b-arbitrary (Byzantine) server failures. In th...
متن کامل